Introduction to COMPUGRAPH

Compugraph Ii: a Survey of Research Goals and Main Results

This is a survey of the main aims and results of the ESPRIT Basic Research Working Group COMPUTING BY GRAPH TRANSFORMATION II, 1992-1996, following up the rst phase of COMPUGRAPH, 1989-1992. The research goals and main results are presented within the following three research areas: Foundations, Concurrency, and Graph Transformations for Speciication and Programming.

Final Report Computing by Graph Transformation Ii (compugraph Ii)

Specification and programming (by graph transformation)

In this tutorial, some basic ideas will be outlined and exempliied how graph transformation can be employed in speciication and programming. In particular, some of the respective achievements of the COMPUGRAPH project will be pointed out. Graphs are widely used in many areas of Computer Science and beyond to describe complex system states, structured objects, networks and relations among compon...

Concurrent computing: from Petri nets to graph grammars

Petri nets are widely accepted as a speciication formalism for concurrent and distributed systems. One of the reasons of their success is the fact that they are equipped with a rich theory, including well-understood concurrent semantics; they also provide an interesting benchmark for tools and techniques for the description of concurrent systems. Graph grammars can be regarded as a proper gener...

Top-Down Tree-To-Graph Transducers

We introduce a new syntax-directed translation device called top-down treeto-graph transducer. Such transducers are very similar to the usual top-down tree trans ducers except that the right-hand sides of their rules are hypergraphs rather than trees. Since we are aiming at a device which also allows to translate trees into objects ditTerent from graphs, we focus our attention on so-called tree...